منابع مشابه
Solving General Arithmetic Word Problems
This paper presents a novel approach to automatically solving arithmetic word problems. This is the first algorithmic approach that can handle arithmetic problems with multiple steps and operations, without depending on additional annotations or predefined templates. We develop a theory for expression trees that can be used to represent and evaluate the target arithmetic expressions; we use it ...
متن کاملArithmetic Elliptic Curves in General Position
We combine various well-known techniques from the theory of heights, the theory of “noncritical Belyi maps”, and classical analytic number theory to conclude that the “ABC Conjecture”, or, equivalently, the so-called “Effective Mordell Conjecture”, holds for arbitrary rational points of the projective line minus three points if and only if it holds for rational points which are in “sufficiently...
متن کاملARITHMETIC-BASED FUZZY CONTROL
Fuzzy control is one of the most important parts of fuzzy theory for which several approaches exist. Mamdani uses $alpha$-cuts and builds the union of the membership functions which is called the aggregated consequence function. The resulting function is the starting point of the defuzzification process. In this article, we define a more natural way to calculate the aggregated consequence funct...
متن کاملA General Fixed Rate Arithmetic Coding Method for Constrained Channels
This paper extends the result of earlier work on the application of arithmetic codes to the constrained channel problem. We specifically present a general length-based $xed rate implementation technique which performs the arithmetic coding recursions during each channel time unit. This technique is superior to an earlier unpublished code for general constrained channels. The approach permits th...
متن کاملA sparse H-matrix arithmetic: general complexity estimates
In a preceding paper (Hackbusch, Computing 62 (1999) 89–108), a class of matrices (H-matrices) has been introduced which are data-sparse and allow an approximate matrix arithmetic of almost linear complexity. Several types ofH-matrices have been analysed in Hackbusch (Computing 62 (1999) 89–108) and Hackbusch and Khoromskij (Preprint MPI, No. 22, Leipzig, 1999; Computing 64 (2000) 21–47) which ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the National Academy of Sciences
سال: 1927
ISSN: 0027-8424,1091-6490
DOI: 10.1073/pnas.13.11.748